Pebble game algorithms and sparse graphs
نویسندگان
چکیده
A multi-graph G on n vertices is (k, l)-sparse if every subset of n ≤ n vertices spans at most kn − l edges. G is tight if, in addition, it has exactly kn − l edges. For integer values k and l ∈ [0, 2k), we characterize the (k, l)-sparse graphs via a family of simple, elegant and efficient algorithms called the (k, l)-pebble games.
منابع مشابه
Pebble Game Algorithms and (k, l)-Sparse Graphs
A multi-graph G on n vertices is (k, l)-sparse if every subset of n ≤ n vertices spans at most kn − l edges, 0 ≤ l < 2k. G is tight if, in addition, it has exactly kn − l edges. We characterize (k, l)-sparse graphs via a family of simple, elegant and efficient algorithms called the (k, l)-pebble games. As applications, we use the pebble games for computing components (maximal tight subgraphs) i...
متن کاملSparsity-certifying Graph Decompositions
We describe a new algorithm, the (k, `)-pebble game with colors, and use it to obtain a characterization of the family of (k, `)-sparse graphs and algorithmic solutions to a family of problems concerning tree decompositions of graphs. Special instances of sparse graphs appear in rigidity theory and have received increased attention in recent years. In particular, our colored pebbles generalize ...
متن کاملSparse Hypergraphs and Pebble Game Algorithms
A hypergraph G = (V, E) is (k, `)-sparse if no subset V ′ ⊂ V spans more than k|V ′|−` hyperedges. We characterize (k, `)-sparse hypergraphs in terms of graph theoretic, matroidal and algorithmic properties. We extend several well-known theorems of Haas, Lovász, Nash-Williams, Tutte, and White and Whiteley, linking arboricity of graphs to certain counts on the number of edges. We also address t...
متن کاملGraded Sparse Graphs and Matroids
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures. We define a new family called graded sparse graphs, arising from generically pinned bar-and-joint frameworks, and prove that they also form matroids. We also address several algorithmic problems on graded sparse graph...
متن کاملChecking Mobility and Decomposition of Linkages via Pebble Game Algorithm
The decomposition of linkages into Assur graphs (Assur groups) was developed by Leonid Assur in 1914 to decompose a linkage into fundamental minimal components for the analysis and synthesis of the linkages. In the paper, some new results and new methods are introduced for solving problems in mechanisms, bringing in methods from the rigidity theory community. Using these techniques, an investig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008